Relativized Arthur-Merlin versus Merlin-Arthur games
نویسندگان
چکیده
منابع مشابه
Derandomizing Arthur-Merlin Games
We establish hardness versus randomness trade-oos for Arthur-Merlin games. We create eecient nondeterministic simulations of bounded round Arthur-Merlin games, using a language in exponential time which small circuits cannot decide given access to an oracle for satissability. Our results yield subexponential size proofs for graph nonisomorphism at innnitely many lengths unless the polynomial-ti...
متن کاملGeneralized Quantum Arthur-Merlin Games
This paper investigates the role of interaction and coins in public-coin quantum interactive proof systems (also called quantum Arthur-Merlin games). While prior works focused on classical public coins even in the quantum setting, the present work introduces a generalized version of quantum Arthur-Merlin games where the public coins can be quantum as well: the verifier can send not only random ...
متن کاملMerlin-Arthur Games and Stoquastic Complexity
MA is a class of decision problems for which ‘yes’-instances have a proof that can be efficiently checked by a classical randomized algorithm. We prove that MA has a natural complete problem which we call the stoquastic k-SAT problem. This is a matrix-valued analogue of the satisfiability problem in which clauses are k-qubit projectors with non-negative matrix elements, while a satisfying assig...
متن کاملArthur-Merlin Games in Boolean Decision Trees
It is well known that probabilistic boolean decision trees cannot be much more powerful than deterministic ones Motivated by a question if randomization can signiicantly speed up a nondeterministic computation via a boolean decision tree, we address structural properties of Arthur-Merlin games in this model and prove some lower bounds. We consider two cases of interest, the rst when the length ...
متن کاملQuadratic Simulations of Merlin-Arthur Games
The known proofs of MA ⊆ PP incur a quadratic overhead in the running time. We prove that this quadratic overhead is necessary for black-box simulations; in particular, we obtain an oracle relative to which MA-TIME(t) 6⊆ P-TIME(o(t)). We also show that 2-sided-error Merlin– Arthur games can be simulated by 1-sided-error Arthur–Merlin games with quadratic overhead. We also present a simple, quer...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 1989
ISSN: 0890-5401
DOI: 10.1016/0890-5401(89)90022-9